منابع مشابه
Sets of Weak Exponents of Indecomposability for Irreducible Boolean Matrices
Let IBn be the set of all irreducible matrices in Bn and let SIBn be the set of all symmetric matrices in IBn. Finding an upper bound for the set of indices of matrices in IBn and SIBn and determining gaps in the set of indices of matrices in IBn and SIBn has been studied by many researchers. In this paper, we establish a best upper bound for the set of weak exponents of indecomposability of ma...
متن کاملPeriodicity and Indecomposability
In this paper we characterize the existence of periodic points of odd period greater than one for unimodal mappings of an interval onto itself. The interesting juxtaposition of this condition with the occurrence in inverse limits of the well-known Brouwer-Janiszewski-Knaster continuum is explored. Also obtained is a characterization of indecomposability of certain inverse limits using a single ...
متن کاملIndecomposability Graphs of Rings
We define a subgraph of the zero divisor graph of a ring, associated to the ring idempotents. We study its properties and prove that for large classes of rings the connectedness of the graph is equivalent to the indecomposability of the ring and in those cases we also calculate the graph’s diameter. 2000 Mathematics subject classification: 16U99, 05C99.
متن کاملIndecomposability of cyclic codes
It is stated in Montpetit (1987) that cyclic codes are indecomposable, but it is not true in general. In fhis paper we will give a necessary and sufficient condition for a cyclic code to be indecomposable, using its generator polynomial. @ 1999 Elsevier Science B.V. All rights reserved
متن کاملOn the indecomposability of polynomials
Applying a combinatorial lemma a new sufficient condition for the indecomposability of integer polynomials is established.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1999
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(98)10213-6